Subspace‐by‐subspace preconditioners for structured linear systems
نویسندگان
چکیده
منابع مشابه
Subspace-by-subspace preconditioners for structured linear systems
We consider the iterative solution of symmetric positive-de nite linear systems whose coe cient matrix may be expressed as the outer-product of low-rank terms. We derive suitable preconditioners for such systems, and demonstrate their e ectiveness on a number of test examples. We also consider combining these methods with existing techniques to cope with the commonly-occuring case where the coe...
متن کاملWavelet based preconditioners for sparse linear systems
A class of efficient preconditioners based on Daubechies family of wavelets for sparse, unsymmetric linear systems that arise in numerical solution of Partial Differential Equations (PDEs) in a wide variety of scientific and engineering disciplines are introduced. Complete and Incomplete Discrete Wavelet Transforms in conjunction with row and column permutations are used in the construction of ...
متن کاملBlock preconditioners for symmetric indefinite linear systems
This paper presents a systematic theoretical and numerical evaluation of three common block preconditioners in a Krylov subspace method for solving symmetric indefinite linear systems. The focus is on large-scale real world problems where block approximations are a practical necessity. The main illustration is the performance of the block diagonal, constrained, and lower triangular precondition...
متن کاملSome preconditioners for systems of linear inequalities
We show that a combination of two simple preprocessing steps would generally improve the conditioning of a homogeneous system of linear inequalities. Our approach is based on a comparison among three different but related notions of conditioning for linear inequalities.
متن کاملBlock Approximate Inverse Preconditioners for Sparse Nonsymmetric Linear Systems
Abstract. In this paper block approximate inverse preconditioners to solve sparse nonsymmetric linear systems with iterative Krylov subspace methods are studied. The computation of the preconditioners involves consecutive updates of variable rank of an initial and nonsingular matrix A0 and the application of the Sherman-MorrisonWoodbury formula to compute an approximate inverse decomposition of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra with Applications
سال: 1999
ISSN: 1070-5325,1099-1506
DOI: 10.1002/(sici)1099-1506(199904/05)6:3<213::aid-nla161>3.3.co;2-m